Parameterized Edge Hamiltonicity
نویسندگان
چکیده
We study the parameterized complexity of the classical Edge Hamiltonian Path problem and give several fixed-parameter tractability results. First, we settle an open question of Demaine et al. by showing that Edge Hamiltonian Path is FPT parameterized by vertex cover, and that it also admits a cubic kernel. We then show fixed-parameter tractability even for a generalization of the problem to arbitrary hypergraphs, parameterized by the size of a (supplied) hitting set. We also consider the problem parameterized by treewidth or clique-width. Surprisingly, we show that the problem is FPT for both of these standard parameters, in contrast to its vertex version, which is W-hard for cliquewidth. Our technique, which may be of independent interest, relies on a structural characterization of clique-width in terms of treewidth and complete bipartite subgraphs due to Gurski and Wanke.
منابع مشابه
Waiter-Client and Client-Waiter Hamiltonicity games on random graphs
We study two types of two player, perfect information games with no chance moves, played on the edge set of the binomial random graph G(n, p). In each round of the (1 : q) Waiter-Client Hamiltonicity game, the first player, called Waiter, offers the second player, called Client, q + 1 edges of G(n, p) which have not been offered previously. Client then chooses one of these edges, which he claim...
متن کاملEdge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
The locally twisted cube is a variation of hypercube, which possesses some properties superior to the hypercube. In this paper, we investigate the edge-faulttolerant hamiltonicity of an n-dimensional locally twisted cube, denoted by LTQn. We show that for any LTQn (n ≥ 3) with at most 2n− 5 faulty edges in which each node is incident to at least two fault-free edges, there exists a fault-free H...
متن کاملStructural Properties and Hamiltonicity of Neighborhood Graphs
Let G = (V,E) be a simple undirected graph. N(G) = (V,EN ) is the neighborhood graph of the graph G, if and only if EN = {{a, b} | a 6= b ∧ ∃x ∈ V : {x, a} ∈ E ∧ {x, b} ∈ E}. After discussing several structural properties of N(G), e.g. edge numbers and connectivity, we characterize the hamiltonicity of N(G) by means of chords of a hamiltonian cycle in G.
متن کاملProof that Enhanced Pyramid Networks are 2-Edge-Hamiltonicity
The pyramid network is a hierarchy structure based on meshes. Chen et al. in 2004 proposed a new hierarchy structure, called the enhanced pyramid network, by replacing each mesh at layer greater than one of the pyramid network with a torus. This investigation demonstrates that the enhanced pyramid network with two faulty edges is Hamiltonian. The result is optimal because both edge connectivity...
متن کاملHamiltonicity of Cubic 3-Connected k-Halin Graphs
We investigate here how far we can extend the notion of a Halin graph such that hamiltonicity is preserved. Let H = T ∪ C be a Halin graph, T being a tree and C the outer cycle. A k-Halin graph G can be obtained from H by adding edges while keeping planarity, joining vertices of H − C, such that G − C has at most k cycles. We prove that, in the class of cubic 3-connected graphs, all 14-Halin gr...
متن کامل